Determinantal ideals without minimal free resolutions
نویسندگان
چکیده
منابع مشابه
Free Resolutions and Sparse Determinantal Ideals
A sparse generic matrix is a matrix whose entries are distinct variables and zeros. Such matrices were studied by Giusti and Merle who computed some invariants of their ideals of maximal minors. In this paper we extend these results by computing a minimal free resolution for all such sparse determinantal ideals. We do so by introducing a technique for pruning minimal free resolutions when a sub...
متن کاملMonomial Ideals, Edge Ideals of Hypergraphs, and Their Minimal Graded Free Resolutions
We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph H appears within the resolution of its edge ideal I(H). We discuss when recursive formulas to compute the graded Betti numbers of I(H) in terms of its sub...
متن کاملIdeals of Minors in Free Resolutions
It is interesting to ask how the invariants of the maps i, such as the ideal Ij(bi) generated by the j x j minors of q, reflect the properties of M. For example, it is not hard to show (see Buchsbaum-Eisenbud [4]) that if the grade of M is g (that is, g is the length of a maximal regular sequence contained in J) and r is the rank of the map b (that is, the size of the largest nonvanishing minor...
متن کاملA constructive approach to minimal free resolutions of path ideals of trees
For a rooted tree Γ, we consider path ideals of Γ, which are ideals that are generated by all directed paths of a fixed length in Γ. In this paper, we provide a combinatorial description of the minimal free resolution of these path ideals. In particular, we provide a class of subforests of Γ that are in one-to-one correspondence with the multi-graded Betti numbers of the path ideal as well as p...
متن کاملPlanar Graphs as Minimal Resolutions of Trivariate Monomial Ideals
We introduce the notion of rigid embedding in a grid surface, a new kind of plane drawing for simple triconnected planar graphs. Rigid embeddings provide methods to (1) find well-structured (cellular, here) minimal free resolutions for arbitrary monomial ideals in three variables; (2) strengthen the Brightwell–Trotter bound on the order dimension of triconnected planar maps by giving a geometri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nagoya Mathematical Journal
سال: 1990
ISSN: 0027-7630,2152-6842
DOI: 10.1017/s0027763000003081